On the Cubical Homology Groups of Free Partially Commutative Monoids
نویسنده
چکیده
We study a Leech homology of a locally bounded free partially commutative monoid M(E, I). Given a contravariant natural system of abelian groups F on M(E, I) we build a precubical set T (E, I) with a homological system of abelian groups F and prove that the Leech homology groups Hn(M(E, I), F ) are isomorphic to the cubical homology groups Hn(T (E, I), F ), n > 0. As a consequence we have confirmed a conjecture that if the free partially commutative monoid does not contain > n mutually commuting generators, then its the homological dimension 6 n. We have built the complexes of finite length for a computation of the Leech homology of such monoids and the Hochschild homology of their monoid rings. The results are applied to the homology of asynchronous transition systems. We give the positive answer to a question that the homological dimension of the asynchronous system does not greater than the maximal number of its mutually independent events. We have built the complex for computing the integral homology groups of an asynchronous transition system by the Smith normal form of integer matrices. 2000 Mathematics Subject Classification 16E40, 18B20, 18G10, 18G20, 18G35, 18G40, 20M50, 55U99, 68Q85
منابع مشابه
Cubical Homology of Asynchronous Transition Systems
We show that a set with an action of a locally finite-dimensional free partially commutative monoid and the corresponding semicubical set have isomorpic homology groups. We build a complex of finite length for the computing homology groups of any asynchronous transition system with finite maximal number of mutually independent events. We give examples of computing the homology groups. 2000 Math...
متن کاملPartially Commutative Inverse Monoids
Free partially commutative inverse monoids are investigated. Analogously to free partially commutative monoids (trace monoids), free partially commutative inverse monoids are the quotients of free inverse monoids modulo a partially defined commutation relation on the generators. A quasi linear time algorithm for the word problem is presented, more precisely, we give an O(n log(n)) algorithm for...
متن کامل2 9 Ju n 20 06 Resolutions of free partially commutative monoids
In this paper we construct a free resolution for a free partially commutative monoid and with its help prove the Husainov’s Conjecture. We follow the ideas of D. Cohen who built in [3] a resolution for the so-called graph product of groups, given resolutions for factors. The presentation of the graph product with the help of direct and free amalgamated products played the leading role at that. ...
متن کاملEfficient Solution to Some Problems in Free Partially Commutative Monoids
In theoretical computer science, and, in particular, in automata and formal language theory, questions arise concerning words and sets of words in free monoids. Results and techniques from the study of the combinatorial algebra of the free monoid have provided an “algebraic” basis for dealing with many of these questions. In recent years there has been increasing interest in properties of words...
متن کاملPublic Key Cryptosystems Based on Free Partially Commutative Monoids and Groups
At INDOCRYPT 2003 Abisha, Thomas, and Subramanian proposed two public key schemes based on word problems in free partially commutative monoids and groups. We show that both proposals are vulnerable to chosen ciphertext attacks, and thus in the present form must be considered as insecure.
متن کامل